#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;

#define in read()
#define pii pair<int,int>
#define fi first
#define se second
#define FILE(x) freopen(x".in","r",stdin);\
	freopen(x".out","w",stdout);
#define pb push_back

int read(){
	int x = 0,sgn = 1;char ch = getchar();
	for(;!isdigit(ch);ch = getchar()) if(ch == '-') sgn = -1;
	for(;isdigit(ch);ch = getchar()) x = (x<<1)+(x<<3)+(ch^48);
	return x*sgn;
}

const int N = 1e5+10;
const int inf = 0x3f3f3f3f;

int h[N],dis[N],incf[N],cnt = 1,cost,maxflow,pre[N],n,m,t[55][110],S,T,tot,p[N];
bool vis[N];
struct edge{int v,w,c,nxt;}e[N<<7];
void link(int x,int y,int w,int c){e[++cnt] = (edge){y,w,c,h[x]};h[x] = cnt;e[++cnt] = (edge){x,0,-c,h[y]};h[y] = cnt;}

bool spfa(){
	memset(vis,0,sizeof vis); memset(dis,0x3f,sizeof dis); dis[S] = 0; vis[S] = 1; queue<int> q; q.push(S); incf[S] = inf;
	while(q.size()){
		int x = q.front(); q.pop();
		for(int i = h[x],y;i;i = e[i].nxt){
			if(dis[y = e[i].v] > dis[x] + e[i].c && e[i].w){
				dis[y] = dis[x] + e[i].c; pre[y] = i; incf[y] = min(incf[x],e[i].w); if(!vis[y]) vis[y] = 1,q.push(y);
			}
		}vis[x] = 0;
	}return dis[T] < inf;
}

int update(int x = T){
	int p = -1; while(x ^ S) {int i = pre[x]; if(!~p && x ^ T) p = x; e[i].w -= incf[T]; e[i ^ 1].w += incf[T]; x = e[i ^ 1].v;}
	cost += incf[T] * dis[T]; maxflow += incf[T]; return p;
}

int main (){
#ifndef ONLINE_JUDGE
	freopen("1.in","r",stdin);
#endif
	n = in,m = in;
	for(int i = 1;i <= n;i++) p[i] = in,tot += p[i];
	for(int i = 1;i <= n;i++) for(int j = 1;j <= m;j++) t[i][j] = in;
	S = 0; T = tot * (m + 1) + n + 1;
	for(int i = 1;i <= n;i++) link(S,i,p[i],0);
	for(int i = 1;i <= n;i++) for(int j = 1;j <= m;j++) link(i,j * tot + 1,1,t[i][j]);
	for(int j = 1;j <= m;j++) link(j * tot + 1,T,1,0);
	while(spfa()){
		int p = update();
		for(int i = 1;i <= n;i++) link(i,p + 1,1,t[i][p / tot] * (p % tot + 1));
		link(p + 1,T,1,0);
	}
	printf("%d\n",cost);
	return 0;
}

